Small covering designs by branch-and-cutMARGOT, Francois.Mathematical programming. 2003, Vol 94, Num 2-3, pp 207-220, issn 0025-5610, 14 p.Conference Paper

A note on the undirected rural postman problem polytopeREINELT, Gerhard; THEIS, Dirk Oliver.Mathematical programming. 2006, Vol 106, Num 3, pp 447-452, issn 0025-5610, 6 p.Article

Polyhedral results for two-connected networks with bounded ringsFORTZ, B; LABBE, M.Mathematical programming. 2002, Vol 93, Num 1, pp 27-54, issn 0025-5610Article

Detecting symmetries by Branch & CutBUCHHEIM, Christoph; JÜNGER, Michael.Lecture notes in computer science. 2002, pp 178-188, issn 0302-9743, isbn 3-540-43309-0Conference Paper

On splittable and unsplittable flow capacitated network design arc-set polyhedraATAMTÜRK, Alper; RAJAN, Deepak.Mathematical programming. 2002, Vol 92, Num 2, pp 315-333, issn 0025-5610Article

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and deliverySUBRAMANIAN, Anand; UCHOA, Eduardo; ALVES PESSOA, Artur et al.Operations research letters. 2011, Vol 39, Num 5, pp 338-341, issn 0167-6377, 4 p.Article

New formulations and valid inequalities for a bilevel pricing problemDEWEZ, Sophie; LABBD, Martine; MARCOTTE, Patrice et al.Operations research letters. 2008, Vol 36, Num 2, pp 141-149, issn 0167-6377, 9 p.Article

A branch-and-cut algorithm for the pallet loading problemALVAREZ-VALDES, R; PARRENO, F; TAMARIT, J. M et al.Computers & operations research. 2005, Vol 32, Num 11, pp 3007-3029, issn 0305-0548, 23 p.Article

A branch and cut algorithm for hub location problems with single assignmentLABBE, Martine; YAMAN, Hande; GOURDIN, Eric et al.Mathematical programming. 2005, Vol 102, Num 2, pp 371-405, issn 0025-5610, 35 p.Article

Using simulated annealing to design a material-handling system : Advanced heuristics in transportation and logisticsCARICATO, Pierpaolo; GRIECO, Antonio.IEEE intelligent systems. 2005, Vol 20, Num 4, pp 26-30, issn 1541-1672, 5 p.Article

On capacitated network design cut-set polyhedraATAMTÜRK, Alper.Mathematical programming. 2002, Vol 92, Num 3, pp 425-437, issn 0025-5610Conference Paper

GD 2002 : graph drawing (Irvine CA, 26-28 August 2002, revised papers)Goodrich, Michael T; Kobourov, Stephen G.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-00158-1, XIII, 384 p, isbn 3-540-00158-1Conference Proceedings

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loadingCORDEAU, Jean-François; DELL'AMICO, Mauro; IORI, Manuel et al.Computers & operations research. 2010, Vol 37, Num 5, pp 970-980, issn 0305-0548, 11 p.Article

A note on the continuous mixing setZHAO, M; DE FARIAS, I. R.Operations research letters. 2008, Vol 36, Num 6, pp 726-733, issn 0167-6377, 8 p.Article

Solving capacitated arc routing problems using a transformation to the CVRPLONGO, Humberto; POGGI DE ARAGAO, Marcus; UCHOA, Eduardo et al.Computers & operations research. 2006, Vol 33, Num 6, pp 1823-1837, issn 0305-0548, 15 p.Article

Combinatorial algorithms for the maximum k-plex problemMCCLOSKY, Benjamin; HICKS, Illya V.Journal of combinatorial optimization. 2012, Vol 23, Num 1, pp 29-49, issn 1382-6905, 21 p.Article

A branch and cut algorithm for the hierarchical network design problemOBREQUE, Carlos; DONOSO, Macarena; GUTIERREZ, Gabriel et al.European journal of operational research. 2010, Vol 200, Num 1, pp 28-35, issn 0377-2217, 8 p.Article

An exact approach for the vehicle routing problem with two-dimensional loading constraintsIORI, Manuel; SALAZAR-GONZALEZ, Juan-José; VIGO, Daniele et al.Transportation science. 2007, Vol 41, Num 2, pp 253-264, issn 0041-1655, 12 p.Article

On the domino-parity inequalities for the STSPBOYD, Sylvia; COCKBURN, Sally; VELLA, Danielle et al.Mathematical programming. 2007, Vol 110, Num 3, pp 501-519, issn 0025-5610, 19 p.Article

A branch-and-cut algorithm for multiple sequence alignmentALTHAUS, Ernst; CAPRARA, Alberto; LENHOF, Hans-Peter et al.Mathematical programming. 2006, Vol 105, Num 2-3, pp 387-425, issn 0025-5610, 39 p.Article

A branch-and-cut algorithm for scheduling of projects with variable-intensity activitiesKIS, Tamas.Mathematical programming. 2005, Vol 103, Num 3, pp 515-539, issn 0025-5610, 25 p.Article

A branch-and-cut algorithm for the discrete (r|p)-centroid problemROBOREDO, Marcos Costa; PESSOA, Artur Alves.European journal of operational research. 2013, Vol 224, Num 1, pp 101-109, issn 0377-2217, 9 p.Article

The Traveling Salesman Problem with Draft LimitsGLOMVIK RAKKE, Jorgen; CHRISTIANSEN, Marielle; FAGERHOLT, Kjetil et al.Computers & operations research. 2012, Vol 39, Num 9, pp 2161-2167, issn 0305-0548, 7 p.Article

The discrete facility location problem with balanced allocation of customersMARIN, Alfredo.European journal of operational research. 2011, Vol 210, Num 1, pp 27-38, issn 0377-2217, 12 p.Article

A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing ProblemSOLYALI, Oguz; SÜRAL, Haldun.Transportation science. 2011, Vol 45, Num 3, pp 335-345, issn 0041-1655, 11 p.Article